1155. Number of Dice Rolls With Target Sum - LeetCode Solution


Dynamic Programming

Python Code:

class Solution:
    def numRollsToTarget(self, d: int, f: int, target: int) -> int:

        dp = []


        for i in range(d+1):
            a = []
            for j in range(target+1):
                a.append(-1)
            dp.append(a)



        def trav(d, f, target):
            if target == 0 and d == 0:
                return 1

            if target <= 0 or d<= 0:
                return 0


            if dp[d][target] != -1:
                return dp[d][target]

            dp[d][target] = 0

            for i in range(1, f+1, 1):
                dp[d][target] += trav(d-1, f, target - i)

            return dp[d][target]

        return trav(d, f, target)%(10**9 + 7)


Comments

Submit
0 Comments
More Questions

1399A - Remove Smallest
208A - Dubstep
1581A - CQXYM Count Permutations
337A - Puzzles
495A - Digital Counter
796A - Buying A House
67A - Partial Teacher
116A - Tram
1472B - Fair Division
1281C - Cut and Paste
141A - Amusing Joke
112A - Petya and Strings
677A - Vanya and Fence
1621A - Stable Arrangement of Rooks
472A - Design Tutorial Learn from Math
1368A - C+=
450A - Jzzhu and Children
546A - Soldier and Bananas
32B - Borze
1651B - Prove Him Wrong
381A - Sereja and Dima
41A - Translation
1559A - Mocha and Math
832A - Sasha and Sticks
292B - Network Topology
1339A - Filling Diamonds
910A - The Way to Home
617A - Elephant
48A - Rock-paper-scissors
294A - Shaass and Oskols